منابع مشابه
On Negation As Instantiation
Given a logic program P and a goal G, we introduce a notion which states when an SLD-tree for P fGg instantiates a set of variables V with respect to another one, W. We call this notion weak instantiation, as it is a generalisation of the instantiation property introduced by Di Pierro, Martelli and Palamidessi. A negation rule based on instanti-ation, the so-called Negation As Instantiation rul...
متن کاملMore on Empirical Negation
Intuitionism can be seen as a verificationism restricted to mathematical discourse. An attempt to generalize intuitionism to empirical discourse presents various challenges. One of those concerns the logical and semantical behavior of what has been called ‘empirical negation’. An extension of intuitionistic logic with empirical negation was given by Michael De and a labelled tableaux system was...
متن کاملEfficient Execution of HiLog in WAM-based Prolog Implementations
In this paper we address the problem of eeciently implementing HiLog, a logic programming language with higher-order syntax and rst-order semantics. In contrast to approaches proposed in the literature that modify, or abandon the WAM framework in order to implement HiLog, our approach to the problem stems from a belief that the WAM should be an adequate abstract machine for the execution of any...
متن کاملSorted HiLog: Sorts in Higher-Order Logic Data Languages
HiLog enhances the modeling capabilities of deductive databases and logic programming with higher-order and meta-data constructs, complex objects, and schema browsing. Its distinctive feature, a higher-order syntax with a rst-order semantics, allows for eecient implementation with speeds comparable to Prolog. In fact, HiLog implementation in XSB 30, 26] together with tabulated query evaluation ...
متن کاملNegation Without Negation in Probabilistic Logic Programming
Probabilistic logic programs without negation can have cycles (with a preference for false), but cannot represent all conditional distributions. Probabilistic logic programs with negation can represent arbitrary conditional probabilities, but with cycles they create logical inconsistencies. We show how allowing negative noise probabilities allows us to represent arbitrary conditional probabilit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1994
ISSN: 0743-1066
DOI: 10.1016/0743-1066(94)90040-x